Experiments with the Plaintext Space in Gentry’S Somewhat Homomorphic Scheme
نویسندگان
چکیده
منابع مشابه
Multi-integer Somewhat Homomorphic Encryption Scheme with China Remainder Theorem
As an effective solution to protect the privacy of the data, homomorphic encryption has become a hot research topic. Existing homomorphic schemes are not truly practical due to their high computational complexity and huge key size. In 2013, Coron et al. proposed a batch homomorphic encryption scheme, i.e. a scheme that supports encrypting and homomorphically evaluating several plaintext bits as...
متن کاملAn Efficient Somewhat Homomorphic Encryption Scheme Based on Factorization
Surprisingly, most of existing provably secure FHE or SWHE schemes are lattice-based constructions. It is legitimate to question whether there is a mysterious link between homomorphic encryptions and lattices. This paper can be seen as a rst (partial) negative answer to this question. We propose a very simple private-key (partially) homomorphic encryption scheme whose security relies on factori...
متن کاملCryptanalysis of Brenner et al.'s Somewhat Homomorphic Encryption Scheme
Recently, Brenner et al. proposed a symmetric somewhat homomorphic encryption scheme and applied it to solve some practical problems, such as the Millionaires’ problem, which only need to evaluate circuits of limited depth. It is claimed that the security of their scheme is built on the hardness of integer factorization. In this paper, we use the Euclidean Greatest Common Divisor (GCD) algorith...
متن کاملSomewhat-connectedness and somewhat-continuity in the product space
In this paper, the concept of somewhat-connected space will be introduced and characterized. Its connection with the other well-known concepts such as the classical connectedness, the $omega_theta$-connectedness, and the $omega$-connectedness will be determined. Moreover, the concept of textit{somewhat}-continuous function from an arbitrary topological space into the product space will be chara...
متن کاملWhich Ring Based Somewhat Homomorphic Encryption Scheme is Best?
The purpose of this paper is to compare side-by-side the NTRU and BGV schemes in their non-scale invariant (messages in the lower bits), and their scale invariant (message in the upper bits) forms. The scale invariant versions are often called the FV and YASHE schemes. As an additional optimization, we also investigate the affect of modulus reduction on the scale-invariant schemes. We compare t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tatra Mountains Mathematical Publications
سال: 2012
ISSN: 1210-3195
DOI: 10.2478/v10127-012-0044-6